CO in DYNAMIC PPOQRkMMINQ , SUrCESSIVE APPROXIMATIONS AND VARIATIONAL PROBLEMS OF COMBINATORIAL NATURE
نویسنده
چکیده
منابع مشابه
Optimal Control of Delayed Differential-Algebraic Inclusions
This paper concerns constrained dynamic optimization problems governed by delayed differentialalgebraic systems. Dynamic constraints in such systems, which are particularly important for engineering applications, are described by interconnected delay-differential inclusions and algebraic equations. We pursue a two-hold goal: to study variational stability of such control systems with respect to...
متن کاملVariational Analysis of Evolution Inclusions
The paper is devoted to optimization problems of the Bolza and Mayer types for evolution systems governed by nonconvex Lipschitzian differential inclusions in Banach spaces under endpoint constraints described by finitely many equalities and inequalities. with generally nonsmooth functions. We develop a variational analysis of such problems mainly based on their discrete approximations and the ...
متن کاملHow to calculate partition functions using convex programming hierarchies: provable bounds for variational methods
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods to get algorithms for calculating partition functions in these families. These techniques give new, non-trivial approximation guarantees for the partition f...
متن کاملApproximate Solution of Fuzzy Fractional Differential Equations
In this paper we propose a method for computing approximations of solution of fuzzy fractional differential equations using fuzzy variational iteration method. Defining a fuzzy fractional derivative, we verify the utility of the method through two illustrative examples.
متن کاملDynamic Trees: A Structured Variational Method Giving Efficient Propagation Rules
Dynamic trees are mixtures of tree struc tured belief networks. They solve some of the problems of fixed tree networks at the cost of making exact inference intractable. For this reason approximate methods such as sampling or mean field approaches have been used. However, mean field approximations assume a factorised distribution over node states. Such a distribution seems unlikely in the post...
متن کامل